On the ASTA property in a feedback processor-sharing queue

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the ASTA property in a feedback processor-sharing queue

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...

متن کامل

Monotonicity in the limited processor sharing queue

We study a processor sharing queue with a limited number of service positions and an infinite buffer. The occupied service positions share an underlying resource. We prove that for service times with a decreasing failure rate, the queue length is stochastically decreasing in the number of service positions, and that for service times with an increasing failure rate, the queue length is stochast...

متن کامل

Fluid approximations for a processor-sharing queue

This paper studies the uid approximation, also known as the functional strong law-of-large-numbers, for a GI/G/1 queue under a processor-sharing service discipline. The uid (approximation) limit in general depends on the service time distribution, and the convergence is in general in the Skorohod J 1 topology. This is in contrast to the known result for the GI/G/1 queue under a FIFO service dis...

متن کامل

The Asta Property

ed to fairly general stochastic processes, entirely divorced from a queueing setting; any pair consisting of a real-valued stochastic process and a point process over a common probability space will do. In this general setting, the queueing terminology is modified: time-observed statistics become time averages, and job-observed statistics become event averages. At its most general, the ASTA set...

متن کامل

On a processor sharing queue that models balking

We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others in the system “balks” (i.e., decides not to enter) with probability 1 − bn. If bn is inversely proportional to n + 1, we obtain explicit expressions for a tagged customer’s sojourn time distribution. We consider both the conditional distribution, conditioned on the number of oth...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Performance Evaluation

سال: 2004

ISSN: 0166-5316

DOI: 10.1016/j.peva.2004.05.003